منابع مشابه
Comparisons between quantum state distinguishability measures
We provide a compendium of inequalities between several quantum state distinguishability measures. For each measure these inequalities consist of the sharpest possible upper and lower bounds in terms of another measure. Some of these inequalities are already known, but new or more general proofs are given, whereas other inequalities are new. We also supply cases of equality to show that all ine...
متن کاملCryptographic Distinguishability Measures for Quantum-Mechanical States
This paper, mostly expository in nature, surveys four measures of distinguishability for quantum-mechanical states. This is done from the point of view of the cryptographer with a particular eye on applications in quantum cryptography. Each of the measures considered is rooted in an analogous classical measure of distinguishability for probability distributions: namely, the probability of an id...
متن کاملon distinguishability versus indistinguishability
The following comments are from the book Quantum Mechanics by Claude CohenTannoudji, Bernard Diu, and Franck Laloë. Identical particles: definition Two particles are said to be identical if all their intrinsic properties (mass, spin, charge, etc.) are exactly the same: no experiment can distinguish one from the other. Thus, all electrons in the universe are identical, as are all the protons and...
متن کاملTight Bounds on Profile Redundancy and Distinguishability
The minimax KL-divergence of any distribution from all distributions in a collection P has several practical implications. In compression, it is called redundancy and represents the least additional number of bits over the entropy needed to encode the output of any distribution in P . In online estimation and learning, it is the lowest expected log-loss regret when guessing a sequence of random...
متن کاملFrom Absolute Distinguishability to Positive Distinguishability
We study methods of converting algorithms that distinguish pairs of distributions with a gap that has an absolute value that is noticeable into corresponding algorithms in which the gap is always positive (and noticeable). Our focus is on designing algorithms that, in addition to the tested string, obtain a fixed number of samples from each distribution. Needless to say, such algorithms can not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1983
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093870230